________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        05.02.2010 00:12:12
Input Data from:  dataset223.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :40
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,063125
Average f[i]   :4912,5
Average g[i,j] :2005,26315789474
Total demand   :10920
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 39
> Selected Move:	1210	1	-1	4	5500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1210


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 149
> Selected Move:	1330	1	-1	2	11000


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1330


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 185
> Selected Move:	1760	1	-1	3	15000


> New Y[]: 
	
	 2  3  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 1760


> New S[]: 
	
	 1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 219
> Selected Move:	2210	1	-1	6	20000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2210


> New S[]: 
	
	 1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 215
> Selected Move:	2780	1	-1	9	25000


> New Y[]: 
	
	 2  3  1  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 2780


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 175
> Selected Move:	3040	3	2	10	25000


> New Y[]: 
	
	 2  3  0  1  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3040


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 152
> Selected Move:	3490	3	3	25	25000


> New Y[]: 
	
	 2  3  0  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3490


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 139
> Selected Move:	3710	3	4	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0    >new incumb.: 3710


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 220
> Selected Move:	3940	3	6	39	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1    >new incumb.: 3940


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 213
> Selected Move:	3940	3	9	35	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 124
> Selected Move:	3930	3	11	19	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 186
> Selected Move:	4020	3	35	30	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1    >new incumb.: 4020


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 171
> Selected Move:	3940	3	10	29	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 108
> Selected Move:	4020	3	1	10	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 47
> Selected Move:	4020	4	10	30	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 89
> Selected Move:	4020	3	19	11	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 54
> Selected Move:	4020	3	29	20	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 115
> Selected Move:	4020	3	11	19	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 130
> Selected Move:	4020	4	30	10	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 123
> Selected Move:	3930	3	10	9	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 96
> Selected Move:	3930	4	9	30	23300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 168
> Selected Move:	3940	3	19	11	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 141
> Selected Move:	3940	3	30	10	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 161
> Selected Move:	3940	4	10	9	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 130
> Selected Move:	3940	4	9	11	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 153
> Selected Move:	3930	3	11	19	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  3  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 147
> Selected Move:	3930	4	19	9	24000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 164
> Selected Move:	3930	4	9	10	23300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 194
> Selected Move:	3930	4	10	25	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 143
> Selected Move:	3930	4	25	39	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 145
> Selected Move:	3920	3	20	29	24700


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  3 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 82
> Selected Move:	3920	4	39	9	24000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 88
> Selected Move:	3940	3	9	1	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 225
> Selected Move:	4125	1	-1	31	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 78
> Selected Move:	4210	3	10	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1    >new incumb.: 4210


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 112
> Selected Move:	4210	3	24	38	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 129
> Selected Move:	4150	3	38	22	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 131
> Selected Move:	4118	3	22	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 105
> Selected Move:	4120	3	31	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 136
> Selected Move:	4113	3	22	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 137
> Selected Move:	4110	3	9	38	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 114
> Selected Move:	4135	3	3	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 42 #######################


> Neighbours evaluated; 116
> Selected Move:	4070	3	10	22	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 43 #######################


> Neighbours evaluated; 146
> Selected Move:	4065	3	38	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 44 #######################


> Neighbours evaluated; 147
> Selected Move:	4050	3	22	3	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 45 #######################


> Neighbours evaluated; 142
> Selected Move:	4013	3	3	24	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 46 #######################


> Neighbours evaluated; 125
> Selected Move:	4010	3	10	38	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 47 #######################


> Neighbours evaluated; 149
> Selected Move:	4060	3	24	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 48 #######################


> Neighbours evaluated; 101
> Selected Move:	4090	3	38	31	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 49 #######################


> Neighbours evaluated; 103
> Selected Move:	4000	3	17	3	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 50 #######################


> Neighbours evaluated; 156
> Selected Move:	3990	3	31	17	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 51 #######################


> Neighbours evaluated; 130
> Selected Move:	4000	3	3	22	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 52 #######################


> Neighbours evaluated; 131
> Selected Move:	4000	3	17	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 53 #######################


> Neighbours evaluated; 156
> Selected Move:	3958	3	22	17	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 54 #######################


> Neighbours evaluated; 137
> Selected Move:	3910	3	17	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,335

## ITERATION 55 #######################


> Neighbours evaluated; 132
> Selected Move:	3950	3	24	22	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,33

## ITERATION 56 #######################


> Neighbours evaluated; 174
> Selected Move:	3860	3	29	20	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 57 #######################


> Neighbours evaluated; 137
> Selected Move:	4060	3	3	31	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 58 #######################


> Neighbours evaluated; 147
> Selected Move:	4120	3	22	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 59 #######################


> Neighbours evaluated; 150
> Selected Move:	4120	3	24	38	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 60 #######################


> Neighbours evaluated; 160
> Selected Move:	4070	3	38	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 61 #######################


> Neighbours evaluated; 112
> Selected Move:	4048	3	10	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 62 #######################


> Neighbours evaluated; 135
> Selected Move:	4050	3	31	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 63 #######################


> Neighbours evaluated; 153
> Selected Move:	4043	3	22	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 64 #######################


> Neighbours evaluated; 171
> Selected Move:	4020	3	9	38	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 65 #######################


> Neighbours evaluated; 151
> Selected Move:	3995	3	38	10	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 66 #######################


> Neighbours evaluated; 162
> Selected Move:	4000	3	3	22	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 67 #######################


> Neighbours evaluated; 160
> Selected Move:	3980	3	10	38	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 68 #######################


> Neighbours evaluated; 175
> Selected Move:	3970	3	22	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 69 #######################


> Neighbours evaluated; 125
> Selected Move:	4000	3	38	31	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 70 #######################


> Neighbours evaluated; 131
> Selected Move:	3930	3	20	38	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 71 #######################


> Neighbours evaluated; 169
> Selected Move:	3975	3	17	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 72 #######################


> Neighbours evaluated; 204
> Selected Move:	4070	3	39	29	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 73 #######################


> Neighbours evaluated; 230
> Selected Move:	4008	3	38	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 74 #######################


> Neighbours evaluated; 225
> Selected Move:	3970	3	10	9	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 75 #######################


> Neighbours evaluated; 229
> Selected Move:	3880	3	29	20	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 76 #######################


> Neighbours evaluated; 202
> Selected Move:	3895	3	9	10	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 77 #######################


> Neighbours evaluated; 197
> Selected Move:	3925	3	20	39	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 78 #######################


> Neighbours evaluated; 205
> Selected Move:	3900	3	10	38	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 79 #######################


> Neighbours evaluated; 221
> Selected Move:	3953	3	22	27	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 80 #######################


> Neighbours evaluated; 129
> Selected Move:	3890	3	38	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 81 #######################


> Neighbours evaluated; 138
> Selected Move:	3870	3	27	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 82 #######################


> Neighbours evaluated; 176
> Selected Move:	3910	3	31	20	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 83 #######################


> Neighbours evaluated; 135
> Selected Move:	3910	3	17	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 84 #######################


> Neighbours evaluated; 161
> Selected Move:	3920	3	22	38	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 85 #######################


> Neighbours evaluated; 183
> Selected Move:	3905	3	24	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 86 #######################


> Neighbours evaluated; 118
> Selected Move:	3895	3	38	24	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 87 #######################


> Neighbours evaluated; 103
> Selected Move:	3863	3	10	17	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 88 #######################


> Neighbours evaluated; 116
> Selected Move:	3900	3	24	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 89 #######################


> Neighbours evaluated; 143
> Selected Move:	3910	3	17	31	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 90 #######################


> Neighbours evaluated; 173
> Selected Move:	3820	3	3	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 91 #######################


> Neighbours evaluated; 102
> Selected Move:	3913	3	20	29	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 92 #######################


> Neighbours evaluated; 107
> Selected Move:	3880	3	31	38	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 93 #######################


> Neighbours evaluated; 95
> Selected Move:	3868	3	6	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 94 #######################


> Neighbours evaluated; 156
> Selected Move:	3890	3	38	10	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 95 #######################


> Neighbours evaluated; 109
> Selected Move:	3930	2	29	-1	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 96 #######################


> Neighbours evaluated; 254
> Selected Move:	3930	3	1	27	24900


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 97 #######################


> Neighbours evaluated; 81
> Selected Move:	3930	4	27	9	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 98 #######################


> Neighbours evaluated; 68
> Selected Move:	4020	3	9	30	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 99 #######################


> Neighbours evaluated; 85
> Selected Move:	3930	3	10	9	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 100 #######################


> Neighbours evaluated; 107
> Selected Move:	3930	3	27	4	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 101 #######################


> Neighbours evaluated; 139
> Selected Move:	3930	3	30	10	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 102 #######################


> Neighbours evaluated; 178
> Selected Move:	3930	3	4	27	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 103 #######################


> Neighbours evaluated; 116
> Selected Move:	3920	3	27	29	23300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 104 #######################


> Neighbours evaluated; 122
> Selected Move:	3920	4	10	19	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  3  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 105 #######################


> Neighbours evaluated; 67
> Selected Move:	3920	4	19	25	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 106 #######################


> Neighbours evaluated; 78
> Selected Move:	3920	4	25	29	24600


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 107 #######################


> Neighbours evaluated; 105
> Selected Move:	3910	3	29	30	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 108 #######################


> Neighbours evaluated; 80
> Selected Move:	3920	3	10	29	23300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 109 #######################


> Neighbours evaluated; 84
> Selected Move:	3920	4	30	9	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 110 #######################


> Neighbours evaluated; 49
> Selected Move:	3920	3	9	35	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 111 #######################


> Neighbours evaluated; 47
> Selected Move:	3930	3	29	20	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 112 #######################


> Neighbours evaluated; 104
> Selected Move:	3930	4	35	30	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 113 #######################


> Neighbours evaluated; 159
> Selected Move:	3930	3	30	10	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 114 #######################


> Neighbours evaluated; 139
> Selected Move:	3930	4	10	35	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 115 #######################


> Neighbours evaluated; 168
> Selected Move:	3940	3	19	11	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 116 #######################


> Neighbours evaluated; 126
> Selected Move:	3920	3	20	29	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 117 #######################


> Neighbours evaluated; 57
> Selected Move:	3920	3	11	19	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 118 #######################


> Neighbours evaluated; 68
> Selected Move:	3930	3	29	27	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 119 #######################


> Neighbours evaluated; 100
> Selected Move:	3839	4	35	10	25300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 120 #######################


> Neighbours evaluated; 89
> Selected Move:	3920	3	27	29	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 121 #######################


> Neighbours evaluated; 71
> Selected Move:	3920	3	10	30	24300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  3  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 122 #######################


> Neighbours evaluated; 95
> Selected Move:	3910	3	35	4	23800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 123 #######################


> Neighbours evaluated; 104
> Selected Move:	3935	3	29	10	25300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 124 #######################


> Neighbours evaluated; 166
> Selected Move:	3920	3	10	20	23800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 125 #######################


> Neighbours evaluated; 131
> Selected Move:	3920	3	20	27	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 126 #######################


> Neighbours evaluated; 108
> Selected Move:	3900	3	30	10	24800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,265

## ITERATION 127 #######################


> Neighbours evaluated; 165
> Selected Move:	3910	3	27	29	23800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 128 #######################


> Neighbours evaluated; 191
> Selected Move:	3910	4	10	4	24400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 129 #######################


> Neighbours evaluated; 177
> Selected Move:	3900	3	29	20	24400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,25

## ITERATION 130 #######################


> Neighbours evaluated; 173
> Selected Move:	3900	4	4	10	23800


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,245

## ITERATION 131 #######################


> Neighbours evaluated; 192
> Selected Move:	3880	3	4	8	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 132 #######################


> Neighbours evaluated; 210
> Selected Move:	3890	3	19	11	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 133 #######################


> Neighbours evaluated; 175
> Selected Move:	3890	3	10	30	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 134 #######################


> Neighbours evaluated; 151
> Selected Move:	3880	3	11	19	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 135 #######################


> Neighbours evaluated; 171
> Selected Move:	3880	3	20	27	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 136 #######################


> Neighbours evaluated; 118
> Selected Move:	3880	3	30	10	24800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 137 #######################


> Neighbours evaluated; 118
> Selected Move:	3870	3	27	29	23800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 138 #######################


> Neighbours evaluated; 129
> Selected Move:	3870	4	10	8	24400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 139 #######################


> Neighbours evaluated; 106
> Selected Move:	3880	3	29	20	24400


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  3  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 140 #######################


> Neighbours evaluated; 204
> Selected Move:	3860	4	8	25	25100


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 141 #######################


> Neighbours evaluated; 173
> Selected Move:	3881	3	8	4	25100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,19

## ITERATION 142 #######################


> Neighbours evaluated; 179
> Selected Move:	3891	3	20	29	25100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  3  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 143 #######################


> Neighbours evaluated; 173
> Selected Move:	3892	4	25	29	25100


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  3  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,18

## ITERATION 144 #######################


> Neighbours evaluated; 176
> Selected Move:	3876	3	29	35	25300


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  3  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,185

## ITERATION 145 #######################


> Neighbours evaluated; 200
> Selected Move:	3838	3	35	9	25500


> New Y[]: 
	
	 2  0  0  0  1  0  0  0  0  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,19

## ITERATION 146 #######################


> Neighbours evaluated; 223
> Selected Move:	3854	4	9	4	25400


> New Y[]: 
	
	 2  0  0  0  3  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,195

## ITERATION 147 #######################


> Neighbours evaluated; 240
> Selected Move:	3833	3	4	20	25500


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,2

## ITERATION 148 #######################


> Neighbours evaluated; 199
> Selected Move:	3830	3	9	24	25000


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  3  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,205

## ITERATION 149 #######################


> Neighbours evaluated; 202
> Selected Move:	3830	4	20	10	22800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,21

## ITERATION 150 #######################


> Neighbours evaluated; 241
> Selected Move:	3962	1	-1	29	26800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,215

## ITERATION 151 #######################


> Neighbours evaluated; 177
> Selected Move:	4021	3	24	31	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 152 #######################


> Neighbours evaluated; 135
> Selected Move:	4034	3	10	30	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  1  3  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 153 #######################


> Neighbours evaluated; 157
> Selected Move:	4018	3	29	38	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  3  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 154 #######################


> Neighbours evaluated; 240
> Selected Move:	4001	3	20	29	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  3  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 155 #######################


> Neighbours evaluated; 167
> Selected Move:	3985	3	30	10	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 156 #######################


> Neighbours evaluated; 142
> Selected Move:	3978	3	29	20	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 157 #######################


> Neighbours evaluated; 217
> Selected Move:	3932	3	38	22	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 158 #######################


> Neighbours evaluated; 190
> Selected Move:	3925	3	10	30	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  0  3  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 159 #######################


> Neighbours evaluated; 206
> Selected Move:	3909	3	20	29	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  3  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 160 #######################


> Neighbours evaluated; 120
> Selected Move:	3902	3	30	10	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 161 #######################


> Neighbours evaluated; 118
> Selected Move:	3866	3	31	20	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  3  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 162 #######################


> Neighbours evaluated; 163
> Selected Move:	3879	3	10	30	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 163 #######################


> Neighbours evaluated; 80
> Selected Move:	3933	3	22	38	26300


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 164 #######################


> Neighbours evaluated; 133
> Selected Move:	3856	3	38	3	26300


> New Y[]: 
	
	 2  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 165 #######################


> Neighbours evaluated; 87
> Selected Move:	3847	3	3	24	26800


> New Y[]: 
	
	 2  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  1  3  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 166 #######################


> Neighbours evaluated; 77
> Selected Move:	3850	3	30	1	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,295

## ITERATION 167 #######################


> Neighbours evaluated; 155
> Selected Move:	3945	3	20	9	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,3

## ITERATION 168 #######################


> Neighbours evaluated; 144
> Selected Move:	3930	3	24	17	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 169 #######################


> Neighbours evaluated; 135
> Selected Move:	3903	3	9	10	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,31

## ITERATION 170 #######################


> Neighbours evaluated; 162
> Selected Move:	3900	3	39	31	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 171 #######################


> Neighbours evaluated; 196
> Selected Move:	3915	3	17	24	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 172 #######################


> Neighbours evaluated; 229
> Selected Move:	3860	3	24	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 173 #######################


> Neighbours evaluated; 240
> Selected Move:	3948	3	31	38	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 174 #######################


> Neighbours evaluated; 237
> Selected Move:	3905	3	3	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 175 #######################


> Neighbours evaluated; 246
> Selected Move:	3840	3	10	31	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 176 #######################


> Neighbours evaluated; 242
> Selected Move:	3830	3	22	6	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 177 #######################


> Neighbours evaluated; 178
> Selected Move:	3830	3	6	17	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 178 #######################


> Neighbours evaluated; 186
> Selected Move:	3940	3	19	39	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 179 #######################


> Neighbours evaluated; 89
> Selected Move:	3880	3	38	22	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 180 #######################


> Neighbours evaluated; 101
> Selected Move:	3810	3	17	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 181 #######################


> Neighbours evaluated; 93
> Selected Move:	3825	3	22	38	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 182 #######################


> Neighbours evaluated; 82
> Selected Move:	3820	3	25	19	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 183 #######################


> Neighbours evaluated; 163
> Selected Move:	3950	3	10	28	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,37

## ITERATION 184 #######################


> Neighbours evaluated; 118
> Selected Move:	3950	3	38	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,365

## ITERATION 185 #######################


> Neighbours evaluated; 121
> Selected Move:	3910	3	24	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 186 #######################


> Neighbours evaluated; 88
> Selected Move:	3890	3	17	22	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,355

## ITERATION 187 #######################


> Neighbours evaluated; 138
> Selected Move:	3860	3	28	21	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,35

## ITERATION 188 #######################


> Neighbours evaluated; 97
> Selected Move:	3920	3	22	38	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 189 #######################


> Neighbours evaluated; 101
> Selected Move:	3830	3	21	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 190 #######################


> Neighbours evaluated; 172
> Selected Move:	3880	3	31	28	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 191 #######################


> Neighbours evaluated; 97
> Selected Move:	3845	3	17	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 192 #######################


> Neighbours evaluated; 132
> Selected Move:	3880	3	38	31	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 193 #######################


> Neighbours evaluated; 127
> Selected Move:	3868	3	10	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 194 #######################


> Neighbours evaluated; 137
> Selected Move:	3850	3	31	22	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,315

## ITERATION 195 #######################


> Neighbours evaluated; 168
> Selected Move:	3843	3	22	3	25500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 196 #######################


> Neighbours evaluated; 165
> Selected Move:	3830	3	9	38	24500


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 197 #######################


> Neighbours evaluated; 135
> Selected Move:	3810	3	38	17	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 198 #######################


> Neighbours evaluated; 137
> Selected Move:	3820	3	3	22	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 199 #######################


> Neighbours evaluated; 147
> Selected Move:	3790	3	17	38	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,34

## ITERATION 200 #######################


> Neighbours evaluated; 151
> Selected Move:	3800	3	28	31	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 201 #######################


> Neighbours evaluated; 218
> Selected Move:	3805	3	38	10	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 202 #######################


> Neighbours evaluated; 200
> Selected Move:	3770	3	10	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,345

## ITERATION 203 #######################


> Neighbours evaluated; 190
> Selected Move:	3770	3	39	25	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 204 #######################


> Neighbours evaluated; 212
> Selected Move:	3830	3	22	24	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 205 #######################


> Neighbours evaluated; 217
> Selected Move:	3773	3	19	39	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 206 #######################


> Neighbours evaluated; 113
> Selected Move:	3765	3	24	10	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,325

## ITERATION 207 #######################


> Neighbours evaluated; 96
> Selected Move:	3743	3	17	24	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,32

## ITERATION 208 #######################


> Neighbours evaluated; 107
> Selected Move:	3830	3	29	19	26500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 209 #######################


> Neighbours evaluated; 206
> Selected Move:	3830	2	31	-1	22500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 210 #######################


> Neighbours evaluated; 256
> Selected Move:	3880	3	24	8	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 211 #######################


> Neighbours evaluated; 242
> Selected Move:	3890	3	19	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 212 #######################


> Neighbours evaluated; 215
> Selected Move:	3855	3	8	30	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 213 #######################


> Neighbours evaluated; 121
> Selected Move:	3940	3	10	9	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 214 #######################


> Neighbours evaluated; 116
> Selected Move:	3930	3	11	19	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 215 #######################


> Neighbours evaluated; 173
> Selected Move:	3930	3	9	35	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 216 #######################


> Neighbours evaluated; 168
> Selected Move:	3880	3	35	8	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 217 #######################


> Neighbours evaluated; 163
> Selected Move:	3850	3	8	20	23000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 218 #######################


> Neighbours evaluated; 162
> Selected Move:	3850	3	20	27	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 219 #######################


> Neighbours evaluated; 148
> Selected Move:	3830	3	27	24	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 220 #######################


> Neighbours evaluated; 179
> Selected Move:	3840	3	19	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 221 #######################


> Neighbours evaluated; 129
> Selected Move:	3840	3	30	10	23500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 222 #######################


> Neighbours evaluated; 228
> Selected Move:	3820	3	24	6	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 223 #######################


> Neighbours evaluated; 218
> Selected Move:	3820	3	6	23	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 224 #######################


> Neighbours evaluated; 206
> Selected Move:	3810	3	11	19	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 225 #######################


> Neighbours evaluated; 233
> Selected Move:	3830	3	23	20	22000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,29

## ITERATION 226 #######################


> Neighbours evaluated; 204
> Selected Move:	3940	1	-1	9	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,285

## ITERATION 227 #######################


> Neighbours evaluated; 173
> Selected Move:	3865	3	10	24	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 228 #######################


> Neighbours evaluated; 161
> Selected Move:	3860	3	24	17	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  1  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 229 #######################


> Neighbours evaluated; 167
> Selected Move:	3823	3	17	38	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,27

## ITERATION 230 #######################


> Neighbours evaluated; 200
> Selected Move:	3870	3	9	8	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,275

## ITERATION 231 #######################


> Neighbours evaluated; 114
> Selected Move:	3955	3	20	29	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1 
 > pw :0,28

## ITERATION 232 #######################


> Neighbours evaluated; 110
> Selected Move:	3900	3	8	30	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 233 #######################


> Neighbours evaluated; 113
> Selected Move:	3920	3	38	31	27000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  1  0  0  0  1  1  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 234 #######################


> Neighbours evaluated; 114
> Selected Move:	3880	3	30	15	26000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295
________________________________________________________________

Best solution found: 4210
Run Termination time: 05.02.2010 00:18:36
Run duration: 00:06:23.4062500
________________________________________________________________
